Improving Latency Analysis for Flexible Window-Based GCL Scheduling in TSN Networks by Integration of Consecutive Nodes Offsets

Time-sensitive networking (TSN) is an upcoming set of Ethernet standards designed for real-time and safety-critical Internet-of-Things (IoT) applications in automotive, aerospace, industrial automation domains. With the combination, complexity, flexibility flow control mechanisms TSN connected systems, performance analysis mixed-critical messages becoming a difficult challenge. The flexible window-based gate list (GCL) scheduling model has been proposed as relaxation to assumptions on frames-to-window allocation, mutually exclusive gates opening, scheduled end systems switches, which offers more configuration GCLs. In this article, we are interested providing reliable verification method based network calculus theory drive GCL configurations networks. To best our knowledge, first suitable general GCLs entire networks, by reflecting relative positional relationships windows same priority queues consecutive nodes constructing window limitations into shaper curve, order reduce pessimism latency bounds. We validate through Industrial IoT synthetics test cases two large realistic cases, showing significant reduction delay bounds, correctness scalability comparing with results from previous work simulation results.